|
Sparse non-negative matrix factorization based on kernel and hypergraph regularization
YU Jianglan, LI Xiangli, ZHAO Pengfei
Journal of Computer Applications
2019, 39 (3):
742-749.
DOI: 10.11772/j.issn.1001-9081.2018071617
Focused on the problem that when traditional Non-negative Matrix Factorization (NMF) is applied to clustering, robustness and sparsity are not considered at the same time, which leads to low clustering performance, a sparse Non-negative Matrix Factorization algorithm based on Kernel technique and HyperGraph regularization (KHGNMF) was proposed. Firstly, on the basis of inheriting good performance of kernel technique,
L
2,1 norm was used to improve F-norm of standard NMF, and hyper-graph regularization terms were added to preserve inherent geometric structure information among the original data as much as possible. Secondly,
L
2,1/2 pseudo norm and
L
1/2 regularization terms were merged into NMF model as sparse constraints. Finally, a new algorithm was proposed and applied to image clustering. The experimental results on six standard datasets show that KHGNMF can improve clustering performance (accuracy and normalized mutual information) by 39% to 54% compared with nonlinear orthogonal graph regularized non-negative matrix factorization, and the sparsity and robustness of the proposed algorithm are increased and the clustering effect is improved.
Reference |
Related Articles |
Metrics
|
|